Logic program invertibility in cryptography problems
نویسندگان
چکیده
منابع مشابه
Intractable Problems in Cryptography
We examine several variants of the Diffie-Hellman and Discrete Log problems that are connected to the security of cryptographic protocols. We discuss the reductions that are known between them and the challenges in trying to assess the true level of difficulty of these problems, particularly if they are interactive or have complicated input.
متن کاملCryptography from tensor problems
This manuscript describes a proposal for a new trap-door one-way function of the multivariatequadratic type. It was first posted to the IACR preprint server in May 2012. Subsequently, Enrico Thomae and Christopher Wolf were able to to determine that a small-minors MinRank attack works against this scheme. I would like to thank them for their close study of the proposal. The manuscript follows a...
متن کاملCryptography with Asynchronous Logic Automata
We introduce the use of asynchronous logic automata (ALA) for cryptography. ALA aligns the descriptions of hardware and software for portability, programmability, and scalability. An implementation of the A5/1 stream cipher is provided as a design example in a concise hardware description language, Snap, and we discuss a powerand timingbalanced cell design.
متن کاملDisjunctive Logic Program = Horn Program + Control Program Disjunctive Logic Program = Horn Program + Control Program
This paper presents an alternative view on propositional dis-junctive logic program: Disjunctive program = Control program + Horn program. For this we introduce a program transformation which transforms a disjunctive logic program into a Horn program and a so called control program. The control program consists of only disjunctions of new propositional atoms and controls the \execution" of the ...
متن کاملCryptography from tensor problems (draft)
We describe a new proposal for a trap-door one-way function. The new proposal belongs to the “multivariate quadratic” family but the trap-door is different from existing methods, and is simpler. Known quantum algorithms do not appear to help an adversary attack this trap-door. (Beyond the asymptotic square-root-speedup which applies to all oracle search problems.)
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1902/1/012049